Sparse Signal Recovery via Generalized Entropy Functions Minimization
نویسندگان
چکیده
منابع مشابه
Sparse Signal Recovery via Generalized Entropy Functions Minimization
Compressive sensing relies on the sparse prior imposed on the signal to solve the ill-posed recovery problem in an under-determined linear system. The objective function that enforces the sparse prior information should be both effective and easily optimizable. Motivated by the entropy concept from information theory, in this paper we propose the generalized Shannon entropy function and Rényi e...
متن کاملExact Recovery for Sparse Signal via Weighted l_1 Minimization
Numerical experiments in literature on compressed sensing have indicated that the reweighted l1 minimization performs exceptionally well in recovering sparse signal. In this paper, we develop exact recovery conditions and algorithm for sparse signal via weighted l1 minimization from the insight of the classical NSP (null space property) and RIC (restricted isometry constant) bound. We first int...
متن کاملSparse Signal Recovery via Correlated Degradation Model
Sparse signal recovery aims to recover an unknown signal x ∈ R from few non-adaptive, possibly noisy, linear measurements y∈R using a nonlinear sparsity-promoting algorithm, under the assumption that x is sparse or compressible with respect to a known basis or frame [1]. Specifically, y = Ax+ e, where A ∈ Rm×n is the measurement matrix, e ∈ R is the measurement error, and m n. Many of the spars...
متن کاملSparse Signal Recovery via ECME Thresholding Pursuits
The emerging theory of compressive sensing CS provides a new sparse signal processing paradigm for reconstructing sparse signals from the undersampled linear measurements. Recently, numerous algorithms have been developed to solve convex optimization problems for CS sparse signal recovery. However, in some certain circumstances, greedy algorithms exhibit superior performance than convex methods...
متن کاملBeyond $\ell_1$-norm minimization for sparse signal recovery
Sparse signal recovery has been dominated by the basis pursuit denoise (BPDN) problem formulation for over a decade. In this paper, we propose an algorithm that outperforms BPDN in finding sparse solutions to underdetermined linear systems of equations at no additional computational cost. Our algorithm, called WSPGL1, is a modification of the spectral projected gradient for `1 minimization (SPG...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Signal Processing
سال: 2019
ISSN: 1053-587X,1941-0476
DOI: 10.1109/tsp.2018.2889951